Experiments with TM-LPSAT
نویسندگان
چکیده
We have tested our encoding generated by TM-LPSAT compiler on a number of problems of varying complexity and characteristics, using different SATbased arithmetic constraint solvers. The intention of the experiments 1 was to observe the feasibility of our encoding, the scalability of this approach in temporal metric domains, and how features of different constraint solvers react with characteristics of constraints specific to different kinds of planning.
منابع مشابه
Continuous Time in a SAT-Based Planner
The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of...
متن کاملThe LPSAT Engine & Its Application to Resource Planning
Compilation to boolean satisfiability has become a powerful paradigm for solving AI problems. However, domains that require metric reasoning cannot be compiled efficiently to SAT even if they would otherwise benefit from compilation. We address this problem by introducing the lcnf representation which combines propositional logic with metric constraints. We present lpsat, an engine which solves...
متن کاملProcesses and Continuous Change in a SAT - based Planner 1 Ji - Ae Shin
The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; reusable resources, both numeric and interval-valued; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is c...
متن کاملProcesses and continuous change in a SAT-based planner
The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; reusable resources, both numeric and interval-valued; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is c...
متن کاملCombining linear programming and satisfiability solving for resource planning
Compilation to boolean satisfiability has become a powerful paradigm for solving AI problems. However, domains that require metric reasoning cannot be compiled efficiently to SAT even if they would otherwise benefit from compilation. We address this problem by introducing the LCNF representation that combines propositional logic with metric constraints. We present LPSAT, an engine that solves L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005